import igraph

g = igraph.Graph()

v1 = g.add_vertex('v1')
v2 = g.add_vertex('v2')
v3 = g.add_vertex('v3')
print(v1)
print(v2)
print(v3)

e1 = g.add_edge(0, 1, name='e1')
e2 = g.add_edge(1, 2, name='e2')
print(e1)
print(e2)


paths = g.shortest_paths_dijkstra(v1, v3)
print(type(paths))
for path in paths:
    print(path)